Literatur

AAH92: B. Aronov, F. Aurenhammer, and F. Hoffmann. Minkowski-type theorems and least-squares partitioning. In Proc. of the 8th Annual ACM Symposium on Computational Geometry , pages 350-357, 1992.
AJ93: C. Àlvarez and B. Jenner. A very hard log-space counting class. Theoretical Computer Science
AJ94: C. Àlvarez and B. Jenner. On adaptive Dlogtime and Polylogtime reductions. In Enjalbert et al. [EMW94 ], pages 301-312.
AJ95a: C. Àlvarez and B. Jenner. A note on log space optimization. Computational Complexity
AJ95b: C. Àlvarez and B. Jenner. On adaptive Dlogtime and Polylogtime reductions. Theoretical Computer Science
AL96: E. Allender and K.-J. Lange.
StUSPACE(log n DSPACE( In Proceedings of the 7th International Symposium on Algorithms and Computation In print; also see Electronic Colloquium on Computational Complexity , Report TR96-048, available via http://www.eccc.uni-trier.de/eccc/ ; an enhanced version is invited for a special issue of Mathematical Systems Theory.
BALPS95: Y. Ben-Asher, K.-J. Lange, D. Peleg, and A. Schuster. The complexity of reconfiguring network models. Information and Computation
BF94: H. Bordihn and H. Fernau. Accepting grammars with regulation. International Journal of Computer Mathematics
BF96a: H. Bordihn and H. Fernau. Accepting grammars and systems: an overview. In J. Dassow, G. Rozenberg, and A. Salomaa, editors, Developments in Language Theory II; at the crossroads of mathematics, computer science and biology , pages 199-208, 1996.
BF96b: H. Bordihn and H. Fernau. Accepting grammars and systems via context condition grammars. Journal of Automata, Languages and Combinatorics
BR95: M. Bertol and K. Reinhardt. The tautologies over a finite set are context-free. EATCS Bulletin , 57:196-197, October 1995.
DH95a: C. Damm and M. Holzer. Automata that take advice. In Proceedings of the 20th Conference on Mathematical Foundations of Computer Science , volume 969 of LNCS , pages 149-158. Springer, 1995.
DH95b: C. Damm and M. Holzer. Inductive counting below LOGSPACE. In Proceedings of the 19th Conference on Mathematical Foundations of Computer Science , volume 841 of LNCS , pages 276-285. Springer, 1995. An extended version will appear under the title Inductive Counting for Width Restricted Brachning Programs in Information and Computation.
DHL92: C. Damm, M. Holzer, and K.-J. Lange. The parallel complexity of iterated morphisms and the arithmetic of small numbers. In Proc. 17th Symposium on Mathematical Foundations of Computer Science , number 629 in LNCS, pages 227-235. Springer, 1992.
DHLR94: C. Damm, M. Holzer, K.-J. Lange, and P. Rossmanith. The very low complexity of deterministic 0L languages: D0L is in In G. Rozenberg and A. Salomaa, editors, Developments in Language Theory (Turku, 1993) , pages 305-313. Singapore: World Scientific,
DHR94: C. Damm, M. Holzer, and P. Rossmanith. Expressing uniformity via oracles. In J. Dassow and A. Kelemenova, editors, Developments In Theoretical Computer Science , pages 83-92. Basel: Gordon and Breach Science Publishers, 1994. An extended version will appear in Mathematical Systems Theory.
DMR95: V. Diekert, A. Muscholl, and K. Reinhardt. On codings of traces. In Mayr and Puech [MP95 ], pages 185-196.
DOR94: V. Diekert, E. Ochmanski, and K. Reinhardt. On confluent semi-commutation systems - decidability and complexity results. Information and Computation
EMW94: P. Enjalbert, E. W. Mayr, and K. W. Wagner, editors. Proceedings of the 11th Symposium on Theoretical Aspects of Computer Science , number 775 in LNCS. Springer, 1994.
FB95: H. Fernau and H. Bordihn. Remarks on accepting parallel systems. International Journal of Computer Mathematics
Fer93: H. Fernau. Adult languages of propagating systems with restricted parallelism. J. Inf. Process. Cybern. EIK
Fer94a: H. Fernau. IIFS and codes. In J. Dassow and A. Kelemenova, editors, Developments In Theoretical Computer Science , pages 141-152. Basel: Gordon and Breach Science Publishers, 1994.
Fer94b: H. Fernau. Infinite iterated function systems. Mathematische Nachrichten
Fer94c: H. Fernau. Iterierte Funktionen, Sprachen und Fraktale Mannheim: BI-Verlag, 1994.
Fer94d: H. Fernau. Remarks on adult languages of propagating systems with restricted parallelism. In G. Rozenberg and A. Salomaa, editors, Developments in Language Theory (Turku, 1993) , pages 90-101. Singapore: World Scientific,
Fer95a: H. Fernau. A note on uniformly limited ET0L systems with unique interpretation. Information Processing Letters
Fer95b: H. Fernau. A predicate for separating language classes. EATCS Bulletin , 56:96-97, June 1995.
Fer95c: H. Fernau. Valuations of languages, with applications to fractal geometry. Theoretical Computer Science
Fer96a: H. Fernau. Closure properties of ordered languages. EATCS Bulletin , 58:159-162, February 1996.
Fer96b: H. Fernau. Membership for k -limited ET0L languages is not decidable. Accepted for publication in Journal of Automata, Languages and Combinatorics, 1996.
Fer96c: H. Fernau. On grammar and language families. Fundamenta Informaticae
Fer96d: H. Fernau. On unconditional transfer. In W. Penczek and A. Sza as, editors, Proceedings of the 21st Conference on Mathematical Foundations of Computer Science , volume 1113 of LNCS , pages 348-359, 1996.
Fer96e: H. Fernau. Remarks on propagating partition-limited ET0L systems. Journal of Universal Computer Science
Fer96f: H. Fernau. Scattered context grammars with regulation. Ann. Univ. Bucharest, Math.-Informatics Series
Fer96g: H. Fernau. Valuations, regular expressions, and fractal geometry. Applicable Algebra in Engineering, Communication and Computing
FF96: H. Fernau and R. Freund. Bounded parallelism in array grammars used for character recognition. In P. Perner, P. Wang, and A. Rosenfeld, editors, Advances in Structural and Syntactical Pattern Recognition (Proceedings of the SSPR'96) volume 1121 of LNCS , pages 40-49, 1996.
FH96: H. Fernau and M. Holzer. Accepting multi-agent systems II. To appear in Acta Cybernetica, 1996.
FHB96: H. Fernau, M. Holzer, and H. Bordihn. Accepting multi-agent systems: the case of cooperating distributed grammar systems. Computers and Artificial Intelligence
FLR96: H. Fernau, K.-J. Lange, and K. Reinhardt. Advocating ownership. In V. Chandru, editor, Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science , volume 1180 of LNCS , pages 286-297. Springer, December 1996.
FS94: H. Fernau and L. Staiger. Valuations and unambiguity of languages, with applications to fractal geometry. In S. Abiteboul and E. Shamir, editors, Automata, Languages and Programming, 21st International Colloquium, ICALP 94 , volume 820 of LNCS , pages 11-22, 1994.
FW96: H. Fernau and D. Wätjen. Remarks on regulated limited ET0L systems and regulated context-free grammars. Technical Report WSI-96-19, Universität Tübingen (Germany), Wilhelm-Schickard-Institut für Informatik, 1996. Accepted for publication in Theoretical Computer Science.
Hav92: I. Havel, editor. Proceedings of the 17th Conference on Mathematical Foundations of Computer Science , number 629 in LNCS, Prague, Czechoslavakia, August 1992. Springer.
HL93: M. Holzer and K.-J. Lange. On the complexities of linear LL(1) and LR(1) grammars. In Proceedings of the 9th Conference on Fundamentals of Computation Theory , LNCS, pages 299-308. Springer, 1993.
Hol94: M. Holzer. On emptiness and counting for alternating finite automa ta. In G. Rozenberg and A. Salomaa, editors, Developments in Language Theory (Turku, 1993) , pages 88-97. Singapore: World Scientific,
HR96: M. Holzer and P. Rossmanith. A simpler grammar for Fibonacci numbers. The Fibonacci Quarterly , pages 465-466, November 1996.
Jen95: B. Jenner. Knapsack problems for NL. Information Processing Letters
JMT94: B. Jenner, P. McKenzie, and D. Thérien. Logspace and logtime leaf languages. In Proceedings of the 9th IEEE Symposium on Structure in Complexity , pages 242-254, 1994.
JT95: B. Jenner and J. Torán. Computing functions with parallel queries to NP. Theoretical Computer Science
JT96: B. Jenner and J. Torán. The complexity of obtaining solutions for problems in NP and NL. Technical Report WSI-96-14, Universität Tübingen (Germany), Wilhelm-Schickard-Institut für Informatik, 1996. To appear in: L. Hemaspaandra, A. Selman (Eds.): Complexity Retrospective II, Springer-Verlag.
JuDT96: B. Jenner and P. McKenzie und D. Thérien. Logspace and Logtime leaf languages. Information and Computation
KNR94: M. Kunde, R. Niedermeier, and P. Rossmanith. Faster sorting and routing on grids with diagonals. In Enjalbert et al. [EMW94
KNRR95: M. Kunde, R. Niedermeier, K. Reinhardt, and P. Rossmanith. Optimal average case sorting on arrays. In Mayr and Puech [MP95 ], pages 503-514.
Lan93a: K.-J. Lange. Complexity and structure in formal language theory. In Proceedings of the 9th IEEE Symposium on Structure in Complexity , pages 224-238, 1993. To appear in Fundamenta Informaticae.
Lan93b: K.-J. Lange. Unambiguity of circuits. Theoretical Computer Science
Lan96: K.-J. Lange. Complexity and structure in formal language theory. Fundamenta Informaticae
Lan97: K.-J. Lange. An unambiguous class possessing a complete set. To appear in the Proceedings of STACS'97, LNCS, 1997.
LN93: K.-J. Lange and R. Niedermeier. Data-independences of parallel random access machines. In R. K. Shyamasundar, editor, Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science , number 761 in Lecture Notes in Computer Science, pages 104-113, Bombay, India, December 1993. Springer-Verlag.
LR92: K.-J. Lange and P. Rossmanith. The emptiness problem for intersections of regular languages. In Havel [Hav92 ], pages 346-354.
LR94a: K.-J. Lange and K. Reinhardt. Empty alternation. In B. Rovan, editor, Proceedings of the 19th Conference on Mathematical Foundations of Computer Science , number 841 in Lecture Notes in Computer Science, pages 494-503, Kosice, Slovakia, August 1994. Springer-Verlag.
LR94b: K.-J. Lange and P. Rossmanith. Unambiguous polynomial hierarchies and exponential size. In Proceedings of the 9th IEEE Symposium on Structure in Complexity , pages 106-115, 1994.
LR96: K.-J. Lange and K. Reinhardt. Set automata. In D. S. Bridges, C. Calude, J. Gibbons, S. Reeves, and I. Witten, editors, Combinatorics, Complexity, Logic, Proceedings of DMTCS'96 pages 321-329. Springer-Verlag, 1996.
LRR92: K.-J. Lange, P. Rossmanith, and W. Rytter. Parallel recognition and ranking of context-free languages. In Havel [Hav92 ], pages 24-36.
MP95: E. W. Mayr and C. Puech, editors. Proceedings of the 12th Symposium on Theoretical Aspects of Computer Science , number 900 in LNCS. Springer, 1995.
Nie96: R. Niedermeier. Recursively divisible problems. To appear in Proceedings of the 7th International Symposium on Algorithms and Computation
NR92: R. Niedermeier and P. Rossmanith. Unambiguous simulations of auxiliary pushdown automata and circuits. In I. Simon, editor, Proceedings of the 1st Symposium on Latin American Theoretical Informatics , number 583 in LNCS, pages 387-400, São Paulo, Brazil, April 1992. Springer.
NR93a: R. Niedermeier and P. Rossmanith. Extended locally definable acceptance types. In P. Enjalbert, A. Finkel, and K. W. Wagner, editors, Proceedings of the 10th Symposium on Theoretical Aspects of Computer Science , number 665 in LNCS, pages 473-483. Springer, 1993.
NR93b: R. Niedermeier and P. Rossmanith. On the power of reading and writing simultaneously in parallel computations. In K. W. Ng, P. Raghavan, N. V. Balasubramanian, and F. Y. L. Chin, editors, Proceedings of the 4th International Symposium on Algorithms and Computation , number 762 in LNCS, pages 240-249, Hong Kong, December 1993. Springer.
NR95a: R. Niedermeier and P. Rossmanith. On optimal OROW-PRAM algorithms for computing recursively defined functions. Parallel Processing Letters , 5(2):299-309, June 1995.
NR95b: R. Niedermeier and P. Rossmanith. PRAM's towards realistic parallelism: BRAM's. In Reichel [Rei95a ], pages 363-373.
NR95c: R. Niedermeier and P. Rossmanith. Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits. Information and Computation
NR97: R. Niedermeier and P. Rossmanith. Unambiguous computations and locally definable acceptance types. Theoretical Computer Science To appear.
Rei92a: K. Reinhardt. Counting and empty alternating pushdown automata. In J. Dassow, editor, Developments in Theoretical Computer Science: Proceedings of the 7th International Meeting of Young Computer Scientists , number 6 in Topics in Computer Mathematics, pages 123-132. Gordon and Breach Science Publishes S.A., 1992.
Rei92b: K. Reinhardt. Sorting in-place with a worst case complexity of 1.3 comparisons and transports. In Ibaraki et al., editor, Proceedings of the 3rd International Symposium on Algorithms and Computation , number 650 in Lecture Notes in Computer Science, pages 489-498. Springer-Verlag, 1992.
Rei95a: H. Reichel, editor. Proceedings of the 10th Conference on Fundamentals of Computation Theory , number 965 in LNCS, Dresden, Germany, August 1995. Springer.
Rei95b: K. Reinhardt. On the synchronization of semi-traces. In Reichel [Rei95a ], pages 393-403.
Rei97: K. Reinhardt. Strict sequential P-completeness. To appear in the Proceedings of STACS'97, LNCS, 1997.
RR92: P. Rossmanith and W. Rytter. Observations on time parallel recognition of unambiguous context-free languages. Information Processing Letters

[ Back ]

This page was last updated on Juli 18th, 1997 by P. Meißner